Dynamic Meshes for Accurate Polygonization of Implicit Surfaces with Sharp Features

نویسندگان

  • Yutaka Ohtake
  • Alexander G. Belyaev
  • Alexander A. Pasko
چکیده

The paper presents a novel approach for accurate polygonization of implicit surfaces with sharp features. The approach is based on mesh evolution towards a given implicit surface with simultaneous control of the mesh vertex positions and mesh normals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Meshes for Accurate Polygonization of Isosurfaces with Sharp Features

The paper presents a novel approach for accurate polygonization of isosurfaces with sharp features. The approach is based on mesh evolution towards a given isosurface with simultaneous control of the mesh vertex positions and mesh normals.

متن کامل

Subdivision Surfaces for Fast Approximate Implicit Polygonization

We propose a fast method of generating an approximate polygonal mesh from an implicit surface. Current workstations are still not capable of producing polygon meshes fast enough for the interactive modelling of complex implicit models. We propose a hybrid method that combines current implicit polygonization techniques with the faster sub-division surface technique applied as a post-process to s...

متن کامل

Edge spinning algorithm for implicit surfaces ✩

This paper presents a new fast method for polygonization of implicit surfaces. Our method put emphasis on the shape of triangles generated and on the polygonization speed. The main advantages of the triangulation presented are simplicity and the stable features that can be used for future expansion. The implementation is not complicated and only the standard data structures are used. This algor...

متن کامل

ON ESCHER’S SPIRALS Polygonization of 2-manifolds with boundaries

An algorithm of polygonization of trimmed implicit surfaces yielding surface sheets is presented. These twodimensional manifolds with boundaries result from the set-theoretic difference of an implicit surface and a solid. The algorithm generates the polygonal approximation of the trimmed surface with the mesh adaptation to the manifold boundary.

متن کامل

A Uni ed Approach for Hierarchical Adaptive Tesselation of Surfaces

The polygonization, or tesselation, of surfaces is a classical problem that has many practical applications in computer graphics and geometric modeling. The problem consists in computing a piecewise linear approximation for a smooth surface described either by parametric or implicit functions. A polygonal mesh is the one of the simplest forms of surface description and therefore is the represen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001